Textual Entailment as Syntactic Graph Distance: a rule based and a SVM based approach

نویسندگان

  • Maria Teresa Pazienza
  • Marco Pennacchiotti
  • Fabio Massimo Zanzotto
چکیده

In this paper we define a measure for textual entailment recognition based on the graph matching theory applied to syntactic graphs. We describe the experiments carried out to estimate measure’s parameters with SVM and we report the results obtained on the Textual Entailment Challenge development and testing set.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Evaluation of Summary Using Textual Entailment

This paper describes about an automatic technique of evaluating summary. The standard and popular summary evaluation techniques or tools are not fully automatic; they all need some manual process. Using textual entailment (TE) the generated summary can be evaluated automatically without any manual evaluation/process. The TE system is the composition of lexical entailment module, lexical distanc...

متن کامل

A Study of Textual Entailment

In this paper we study a graph-based approach to the task of Recognizing Textual Entailment between a Text and a Hypothesis. The approach takes into account the full lexico-syntactic context of both the Text and Hypothesis and is based on the concept of subsumption. It starts with mapping the Text and Hypothesis on to graph structures that have nodes representing concepts and edges representing...

متن کامل

Tree Edit Distance as a Baseline Approach for Paraphrase Representation

Finding an adequate paraphrase representation formalism is a challenging issue in Natural Language Processing. In this paper, we analyse the performance of Tree Edit Distance as a paraphrase representation baseline. Our experiments using Edit Distance Textual Entailment Suite show that, as Tree Edit Distance consists of a purely syntactic approach, paraphrase alternations not based on structura...

متن کامل

Recognizing Textual Entailment with Tree Edit Distance: Application to Question Answering and Information Extraction

This thesis addresses the problem of Recognizing Textual Entailment (i.e. recognizing that the meaning of a text entails the meaning of another text) using a Tree Edit Distance algorithm between the syntactic trees of the two texts. A key aspect of the approach is the estimation of the cost for the editing operations (i.e. Insertion, Deletion, Substitution) among words. Our aim is to compare th...

متن کامل

Recognizing Textual Entailment Using Description Logic and Semantic Relatedness

Recognizing Textual Entailment using Description Logic and Semantic Relatedness Reda Siblini, Ph.D. Concordia University, 2014 Textual entailment (TE) is a relation that holds between two pieces of text where one reading the first piece can conclude that the second is most likely true. Accurate approaches for textual entailment can be beneficial to various natural language processing (NLP) appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005